A Minimax Algorithm Faster than Alpha-Beta
نویسنده
چکیده
We present two recursive state space search algorithms that are based on SSS* and Dual*. Both dominate Alpha-Beta on a node count basis and one of them is always faster in searching random trees. These results have been derived on arti cial game trees with negligible leaf node evaluation time. For practical applications with more complex leaf evaluation functions we conjecture that our recursive state space search algorithms perform even better and might eventually supersede the popular directional
منابع مشابه
A Pruning Algorithm for Imperfect Information Game
IMP-minimax is the analog to minimax for games with imperfect information, like card games such as bridge or poker. It computes an optimal strategy for the game if the game has a single player and a certain natural property called perfect recall. IMP-minimax is described fully in a companion paper in this proceedings. Here we introduce an algorithm IMP-alpha-beta that is to IMP-minimax s alpha-...
متن کاملA Pruning Algorithm for Imperfect Information Games
IMP-minimax is the analog to minimax for games with imperfect information, like card games such as bridge or poker. It computes an optimal strategy for the game if the game has a single player and a certain natural property called perfect recall. IMP-minimax is described fully in a companion paper in this proceedings. Here we introduce an algorithm IMP-alpha-beta that is to IMP-minimax as alpha...
متن کاملA Faster Alternative to SSS* with Extension to Variable Memory
The two best known and most frequently referenced minimax search methods for game trees are Alpha-Beta [2] and SSS* [6]. The algorithms are quite dissimilar in structure and properties. Alpha-Beta is a depth-first recursive procedure that needs little memory to execute. Although it evaluates more terminal nodes than SSS*, it generally runs considerably faster owing to its low overhead. In contr...
متن کاملBest-First Minimax Search: First Results
We present a very simple selective minimax search algorithm for two-player gaines. It ahvays expands next the frontier node at the end of the principal variation, or current best line of play, which is the node that determines the minimax value of the root. The algorithm requires no information other than a static evaluation function, and its time overhead per node is similar to that of alpha-b...
متن کاملBest-First Minimax Search
We describe a very simple selective search algorithm for two-player games, called best-first minimax. It always expands next the node at the end of the expected line of play, which determines the minimax value of the root. It uses the same information as alpha-beta minimax, and takes roughly the same time per node generation. We present an implementation of the algorithm that reduces its space ...
متن کامل